// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
int n;
vector<vector<char>> v(15,vector<char>(15));
int ans=0;
bool col[40]={0};
bool dig1[40]={0};
bool dig2[40]={0};
void dfs(int pos)
{
	if(pos==n+1)
	{
		ans++;
		return;
	}
	for(int i=1;i<=n;i++)
	{
		if(col[i]==1||dig1[pos-i+n]==1||dig2[pos+i]==1||v[pos][i]=='.')continue;
		col[i]=1;
		dig1[pos-i+n]=1;
		dig2[pos+i]=1;
		dfs(pos+1);
		col[i]=0;
		dig1[pos-i+n]=0;
		dig2[pos+i]=0;
	}
}
signed main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		{
			cin>>v[i][j];
		}
	}
	dfs(1);
	cout<<ans;
	return 0;
}
